Heterogeneous Finite-Source Retrial Queues
نویسندگان
چکیده
منابع مشابه
Finite-source Retrial Queues with Applications*
We consider a single-server retrial queueing system with a finite number of homogeneous sources generating requests after a random time. The service of an arriving customer finding the server idle starts immediately; otherwise the request enters into an orbit from where the calls are repeated after a random time. Upon completion of a service, with a certain probability the server searches for a...
متن کاملMultiserver Retrial Queues with Finite Number of Heterogeneous Sources∗
The aim of this paper is to investigate a multiserver retrial queueing system with a finite number of heterogeneous sources of calls. The novelty of the investigation is the heterogeneity of the sources, that is every source is characterized by different arrival, retrial and service rates. All random variables involved in the model construction are assumed to be exponentially distributed and in...
متن کاملRetrial Queues for Performance Modelling and Evaluation of Heterogeneous Networks
In this paper a single server retrial queue with a finite number of heterogeneous sources of calls is investigated. It is assumed when a given source is idle it will generate a primary call after an exponentially distributed time. If the server is free at the time of the request’s arrival then the call starts to be served. The service time is also exponentially distributed. During the service t...
متن کاملTool supported modeling of sensor communication networks by using finite - source priority retrial queues ∗
The main aim of the present paper is to draw the attention of the readers of this special issue to the modeling issues of sensor networks. The novelty of this investigation is the introduction of servers vacation combined with priority customers for finite-source retrial queues and its application to wireless sensor networks. In this paper we analyze a priority finite-source retrial queue with ...
متن کاملHomogeneous Finite-Source Retrial Queues with Search of Customers from the Orbit
We consider a retrial queueing system with a finite number of homogeneous sources of calls and a single server. Each source generates a request after an exponentially distributed time. An arriving customer finding the server idle enters into service immediately; otherwise the customer enters into an orbit. The service times are supposed to be exponentially distributed random variables. An orbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2004
ISSN: 1072-3374
DOI: 10.1023/b:joth.0000027024.37864.22